Concurrent Zero Knowledge, Revisited
نویسندگان
چکیده
منابع مشابه
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules—called footer-freeness—that suffices for efficient simulat...
متن کاملConcurrent Zero Knowledge
Up to this point, our proofs of zero knowledgeness of protocols have been based on a simple model of communication in which there are two agents, a prover and a verifier. However, in the real world, situations arise in which there is one prover P (e.g. a web server) and many verifiers Vi (e.g. clients) that have different delays but are all trying to interact with the prover at the same time. S...
متن کاملPrecise Concurrent Zero Knowledge
Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worstcase) time spent by V in the generated view. We provide the first constructions of precise concurrent zero-knowledge protocols. Our constructions have essentially optimal precision; consequently this improves also up...
متن کاملOn Concurrent Zero-Knowledge with Pre-processing
Concurrent Zero-Knowledge protocols remain zero-knowledge even when many sessions of them are executed together. These protocols have applications in a distributed setting, where many executions of the same protocol must take place at the same time by many parties, such as the Internet. In this paper, we are concerned with the number of rounds of interaction needed for such protocols and their ...
متن کاملConcurrent Zero-Knowledge in Poly-logarithmic Rounds
The subject of these notes is concurrent zero knowledge , in particular the construction given in [KP01]. Zero knowledgeness property of zero knowledge proof systems is defined with respect to an adversarial verifier that does not attempt to run multiple instances of a protocol concurrently. It is possible to prove that such protocols can be composed serially without substantial loss of securit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2012
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-012-9137-2